Code spectrum and the reliability function: Gaussian channel
نویسندگان
چکیده
منابع مشابه
Code spectrum and reliability function: Gaussian channel
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat both low and high rate cases in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
متن کاملCode spectrum and the reliability function: Binary symmetric channel
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
متن کاملSupplement to: Code Spectrum and Reliability Function: Binary Symmetric Channel
A much simpler proof of Theorem 1 from [1] is presented below, using notation and formulas numeration of [1]. The text below replaces the subsection General case from §4 of [1, p. 11]. General case. In the general case for some ω we are interested in a pairs (xi,xj) with dij = ωn. But there may exist a pairs (xk,xl) with dkl < ωn. Using the “cleaning” procedure [2] we show that the influence of...
متن کاملThe Reliability Function for the Additive White Gaussian Noise Channel at Rates above the Capacity
We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem. Keywords—Additive white Gaussian noise channels, Strong converse theorem, Information s...
متن کاملA new upper bound on the reliability function of the Gaussian channel
We derive a new upper bound on the exponent of error probability of decoding for the best possible codes in the Gaussian channel. This bound is tighter than the known upper bounds (the sphere-packing and minimum-distance bounds proved in Shannon’s classical 1959 paper and their low-rate improvement by Kabatiansky and Levenshtein). The proof is accomplished by studying asymptotic properties of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2007
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946007020019